Reconfiguring colorings of graphs with bounded maximum average degree
نویسندگان
چکیده
The reconfiguration graph R k ( G ) for the -colorings of a has as vertex set all possible and two colorings are adjacent if they differ in color exactly one . Let d , ? 1 be integers such that + We prove every ? > 0 with n vertices maximum average degree ? diameter O log ? This significantly strengthens several existing results.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملk-forested choosability of graphs with bounded maximum average degree
a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...
متن کاملK-forested Choosability of Graphs with Bounded Maximum Average Degree
A proper vertex coloring of a simple graph is k-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than k. A graph is k-forested qchoosable if for a given list of q colors associated with each vertex v, there exists a k-forested coloring of G such that each vertex receives a color from its own list. In this paper, we prove that the k-fore...
متن کاملBackbone colorings of graphs with bounded degree
We study backbone colorings, a variation on classical vertex colorings: Given a graph G and a spanning subgraphH of G (the backbone of G), a backbone coloring for G and H is a proper vertex k-coloring of G in which the colors assigned to adjacent vertices in H differ by at least 2. The minimal k ∈ N for which such a coloring exists is called the backbone chromatic number of G. We show that for ...
متن کاملPolychromatic colorings of bounded degree plane graphs
A polychromatic k-coloring of a plane graph G is an assignment of k colors to the vertices of G such that every face of G has all k colors on its boundary. For a given plane graph G, we seek the maximum number k such that G admits a polychromatic k-coloring. We call a k-coloring in the classical sense (i.e., no monochromatic edges) that is also a polychromatic k-coloring a strong polychromatic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.11.001